Differential reinforcement effects on matching-order sequences
نویسندگان
چکیده
منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملReinforcement delay fading during differential reinforcement of communication: the effects of signals on response maintenance.
Signals during delays to reinforcement may lessen reductions in responding that typically occur when there is a delay between a response and its reinforcer. Sparse applied research has been devoted to understanding the conditions under which responding may be maintained when delays to reinforcement are introduced. We evaluated the extent to which providing signals during delay fading affected r...
متن کاملPattern Matching on Weighted Sequences
Weighted sequences are used extensively as profiles for protein families, in the representation of binding sites and often for the representation of sequences produced by a shotgun sequencing strategy. We present various fundamental pattern matching problems on weighted sequences and their respective algorithms. In addition, we define two matching probabilistic measures and we give algorithms f...
متن کاملOn Differential Sequences
We introduce the notion of Differential Sequences of ordinary differential equations. This is motivated by related studies based on evolution partial differential equations. We discuss the Riccati Sequence in terms of symmetry analysis, singularity analysis and identification of the complete symmetry group for each member of the Sequence. The singularity analysis reveals considerable structure ...
متن کاملOn-line fuzzy pattern matching on sequences
We consider pattern matching problems where patterns are presented as sequences of fuzzy constraints on input elements. Given an infinite alphabet A, a pattern P [α,β] is a sequence μi1 , μi2 , ..., μim ® of membership functions μij defined on A. The pattern P fuzzy matches an input sequence t ∈ A∗ if t = ux1x2 · · ·xmv such that
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Psychonomic Society
سال: 1984
ISSN: 0090-5054
DOI: 10.3758/bf03333884